A Distance for Partially Labeled Trees
Identifieur interne : 000526 ( Main/Exploration ); précédent : 000525; suivant : 000527A Distance for Partially Labeled Trees
Auteurs : Jorge Calvo [Espagne] ; David Rizo [Espagne] ; M. I Esta [Espagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: In a number of practical situations, data have structure and the relations among its component parts need to be coded with suitable data models. Trees are usually utilized for representing data for which hierarchical relations can be defined. This is the case in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. In those cases, procedures for comparing trees are very relevant. An approximate tree edit distance algorithm has been introduced for working with trees labeled only at the leaves. In this paper, it has been applied to handwritten character recognition, providing accuracies comparable to those by the most comprehensive search method, being as efficient as the fastest.
Url:
DOI: 10.1007/978-3-642-21257-4_61
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002073
- to stream Istex, to step Curation: 001F35
- to stream Istex, to step Checkpoint: 000183
- to stream Main, to step Merge: 000532
- to stream Main, to step Curation: 000526
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Distance for Partially Labeled Trees</title><author><name sortKey="Calvo, Jorge" sort="Calvo, Jorge" uniqKey="Calvo J" first="Jorge" last="Calvo">Jorge Calvo</name></author><author><name sortKey="Rizo, David" sort="Rizo, David" uniqKey="Rizo D" first="David" last="Rizo">David Rizo</name></author><author><name sortKey="I Esta, M" sort="I Esta, M" uniqKey="I Esta M" first="M." last="I Esta">M. I Esta</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:EA1C21E255C1BDB0DE23F114DDD3FA0492581BA8</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-21257-4_61</idno><idno type="url">https://api.istex.fr/document/EA1C21E255C1BDB0DE23F114DDD3FA0492581BA8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002073</idno><idno type="wicri:Area/Istex/Curation">001F35</idno><idno type="wicri:Area/Istex/Checkpoint">000183</idno><idno type="wicri:doubleKey">0302-9743:2011:Calvo J:a:distance:for</idno><idno type="wicri:Area/Main/Merge">000532</idno><idno type="wicri:Area/Main/Curation">000526</idno><idno type="wicri:Area/Main/Exploration">000526</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Distance for Partially Labeled Trees</title><author><name sortKey="Calvo, Jorge" sort="Calvo, Jorge" uniqKey="Calvo J" first="Jorge" last="Calvo">Jorge Calvo</name><affiliation wicri:level="4"><country xml:lang="fr">Espagne</country><wicri:regionArea>Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, E-03080, Alicante</wicri:regionArea><orgName type="university">Université d'Alicante</orgName><placeName><settlement type="city">Alicante</settlement><region nuts="2" type="region">Communauté valencienne</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Espagne</country></affiliation></author><author><name sortKey="Rizo, David" sort="Rizo, David" uniqKey="Rizo D" first="David" last="Rizo">David Rizo</name><affiliation wicri:level="4"><country xml:lang="fr">Espagne</country><wicri:regionArea>Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, E-03080, Alicante</wicri:regionArea><orgName type="university">Université d'Alicante</orgName><placeName><settlement type="city">Alicante</settlement><region nuts="2" type="region">Communauté valencienne</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Espagne</country></affiliation></author><author><name sortKey="I Esta, M" sort="I Esta, M" uniqKey="I Esta M" first="M." last="I Esta">M. I Esta</name><affiliation wicri:level="4"><country xml:lang="fr">Espagne</country><wicri:regionArea>Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, E-03080, Alicante</wicri:regionArea><orgName type="university">Université d'Alicante</orgName><placeName><settlement type="city">Alicante</settlement><region nuts="2" type="region">Communauté valencienne</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Espagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">EA1C21E255C1BDB0DE23F114DDD3FA0492581BA8</idno><idno type="DOI">10.1007/978-3-642-21257-4_61</idno><idno type="ChapterID">61</idno><idno type="ChapterID">Chap61</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In a number of practical situations, data have structure and the relations among its component parts need to be coded with suitable data models. Trees are usually utilized for representing data for which hierarchical relations can be defined. This is the case in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. In those cases, procedures for comparing trees are very relevant. An approximate tree edit distance algorithm has been introduced for working with trees labeled only at the leaves. In this paper, it has been applied to handwritten character recognition, providing accuracies comparable to those by the most comprehensive search method, being as efficient as the fastest.</div></front></TEI><affiliations><list><country><li>Espagne</li></country><region><li>Communauté valencienne</li></region><settlement><li>Alicante</li></settlement><orgName><li>Université d'Alicante</li></orgName></list><tree><country name="Espagne"><region name="Communauté valencienne"><name sortKey="Calvo, Jorge" sort="Calvo, Jorge" uniqKey="Calvo J" first="Jorge" last="Calvo">Jorge Calvo</name></region><name sortKey="Calvo, Jorge" sort="Calvo, Jorge" uniqKey="Calvo J" first="Jorge" last="Calvo">Jorge Calvo</name><name sortKey="I Esta, M" sort="I Esta, M" uniqKey="I Esta M" first="M." last="I Esta">M. I Esta</name><name sortKey="I Esta, M" sort="I Esta, M" uniqKey="I Esta M" first="M." last="I Esta">M. I Esta</name><name sortKey="Rizo, David" sort="Rizo, David" uniqKey="Rizo D" first="David" last="Rizo">David Rizo</name><name sortKey="Rizo, David" sort="Rizo, David" uniqKey="Rizo D" first="David" last="Rizo">David Rizo</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000526 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000526 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:EA1C21E255C1BDB0DE23F114DDD3FA0492581BA8
|texte= A Distance for Partially Labeled Trees
}}
| This area was generated with Dilib version V0.6.32. |  |